منابع مشابه
Invertible Classes
This paper considers when one can invert general recursive operators which map a class of functions F to F . In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map F to F in the sense that for every general recursive operator Ψ mapping F to F , there is a general recursive operator in ...
متن کاملLuby-rackoo Backwards: Increasing Security by Making Block Ciphers Non-invertible Mihir Bellare
We argue that the invertibility of a block cipher can reduce the security of schemes that use it and a better starting point for scheme design is the non invertible analog of a block cipher that is a pseudorandom function PRF Since a block cipher may be viewed as a pseudorandom permutation we are led to investigate the reverse of the problem studied by Luby and Racko and ask how can one transfo...
متن کاملLuby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible
We argue that the invertibility of a block cipher can reduce the security of schemes that use it, and a better starting point for scheme design is the non-invertible analog of a block cipher, that is, a pseudorandom function (PRF). Since a block cipher may be viewed as a pseudorandom permutation, we are led to investigate the reverse of the problem studied by Luby and Rackoff, and ask: “how can...
متن کاملLuby-Racko Backwards: Increasing Security by Making Block Ciphers Non-Invertible
We argue that the invertibility of a block cipher can reduce the security of schemes that use it, and a better starting point for scheme design is the non-invertible analog of a block cipher, that is, a pseudorandom function (PRF). Since a block cipher may be viewed as a pseudorandom permutation, we are led to investigate the reverse of the problem studied by Luby and Racko , and ask: \how can ...
متن کاملIterating Invertible Binary Transducers
We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica
سال: 2022
ISSN: ['2053-2733']
DOI: https://doi.org/10.1107/s205327332209917x